15–212: Fundamental Structures of Computer Science II Some Notes on Grammars and Parsing
نویسندگان
چکیده
These notes are intended as a “rough and ready” guide to grammars and parsing. The theoretical foundations required for a thorough treatment of the subject are developed in the Formal Languages, Automata, and Computability course. The construction of parsers for programming languages using more advanced techniques than are discussed here is considered in detail in the Compiler Construction course.
منابع مشابه
15–212: Fundamental Structures of Computer Science II Some Notes on Induction
These notes provide a brief introduction to induction for proving properties of ML programs. We assume that the reader is already familiar with ML and the notes on evaluation for pure ML programs. Recall that we write n for the representation of the integer n in ML (and, in particular, 0 = 0, 1 = 1, etc.). We write e k =⇒ e′ for a computation of k steps, e =⇒ e′ for a computation of any number ...
متن کامل15–212: Fundamental Structures of Computer Science II Some Notes on Mutable References
Our notion of step in the operational semantics is defined abstractly and does not coincide with the actual operations performed in an implementation of ML. Since we will be mainly concerned with proving correctness, but not complexity of implementation, the number of steps is largely irrelevant and we will write e =⇒ e′ for reduction. Evaluation and reduction are related in the sense that if e...
متن کامل15–212: Fundamental Structures of Computer Science II Some Notes on Interpreters
Specifications are an indispensible part of software development. They explain what must be implemented without necessarily saying how. Depending of the nature of the problem domain, specifications may range from incomplete, natural language descriptions to mathematically precise formulations of the functionality to be implemented. Much of the task of software engineering is to decompose a larg...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کامل15–212: Fundamental Structures of Computer Science II Some Notes on Structural Induction
These notes provide a brief introduction to structural induction for proving properties of ML programs. We assume that the reader is already familiar with ML and the notes on evaluation and natural number induction for pure ML programs. We write e k =⇒ e′ for a computation of k steps, e =⇒ e′ for a computation of any number of steps (including 0), e ↪→ v for a complete computation of e to a val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997